Uniformly Bounded Arrays and Mutually Algebraic Structures
نویسندگان
چکیده
منابع مشابه
Mutually algebraic structures and expansions by predicates
We introduce the notion of a mutually algebraic structure and prove many equivalents. A structure M is mutually algebraic if and only if it has a weakly minimal, trivial theory if and only if every expansion (M,A) by a unary predicate does not have the finite cover property. We show that every structure has a maximal mutually algebraic reduct, and give a strong structure theorem for the class o...
متن کاملCharacterizing Model Completeness Among Mutually Algebraic Structures
We characterize when the elementary diagram of a mutually algebraic structure has a model complete theory, and give an explicit description of a set of existential formulas to which every formula is equivalent. This characterization yields a new, more constructive proof that the elementary diagram of any model of a strongly minimal, trivial theory is model complete.
متن کاملUniformly bounded duplication codes
Duplication is the replacement of a factor w within a word by ww. This operation can be used iteratively to generate languages starting from words or sets of words. By undoing duplications, one can eventually reach a square-free word, the original word’s duplication root. The duplication root is unique, if the length of duplications is fixed. Based on these unique roots we define the concept of...
متن کاملUniformly Redundant Arrays
Uniformly Redundant Arrays (URA’s) are two–dimensional binary arrays with constant sidelobes of their periodic autocorrelation function. They are widely agreed upon to be optimum mask patterns for coded aperture imaging, particularly in imaging systems with a cyclic coded mask. In this paper, a survey of all currently known construction methods for URA’s is given and the sizes and open fraction...
متن کاملUniformly bounded components of normality
Suppose that f(z) is a transcendental entire function and that the Fatou set F (f) 6= ∅. Set B1(f) := sup U supz∈U log(|z| + 3) infw∈U log(|w|+ 3) and B2(f) := sup U supz∈U log log(|z|+ 30) infw∈U log(|w| + 3) , where the supremum supU is taken over all components of F (f). If B1(f) < ∞ or B2(f) < ∞, then we say F (f) is strongly uniformly bounded or uniformly bounded respectively. In this arti...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Notre Dame Journal of Formal Logic
سال: 2020
ISSN: 0029-4527
DOI: 10.1215/00294527-2020-0004